Computing system signatures through reliability functions
نویسندگان
چکیده
منابع مشابه
Computing System Signatures through Reliability Functions
It is known that the Barlow-Proschan index of a system with i.i.d. component lifetimes coincides with the Shapley value, a concept introduced earlier in cooperative game theory. Due to a result by Owen, this index can be computed efficiently by integrating the first derivatives of the reliability function of the system along the main diagonal of the unit hypercube. The Samaniego signature of su...
متن کاملCuriOS: Improving Reliability through Operating System Structure
An error that occurs in a microkernel operating system service can potentially result in state corruption and service failure. A simple restart of the failed service is not always the best solution for reliability. Blindly restarting a service which maintains client-related state such as session information results in the loss of this state and affects all clients that were using the service. C...
متن کاملComputing Inter-Rater Reliability With the SAS System
The SAS system V.8 implements the computation of unweighted and weighted kappa statistics as an option in the FREQ procedure. A major limitation of this implementation is that the kappa statistic can only be evaluated when the number of raters is limited to 2. Extensions to the case of multiple raters due to Fleiss (1971) have not been implemented in the SAS system. A SAS macro called MAGREE.SA...
متن کاملApproximating Reliability of a System with Doubly Bounded Performance Functions
The purpose of this paper is to derive an approximation of the reliability of a system with doubly bounded performance functions. The problem is illustrated through the probability of an n dimensional hyper cube of the multivariate normal distribution. An approximation method is presented to evaluate this probability based on n + 2 computations of the CDF of the multi-normal distribution.
متن کاملLinking Dominations and Signatures in Network Reliability
Comparing the reliability of two networks of more than modest size can be a computationally intensive exercise. In this paper, domination theory and the notion of the signature of a network, and their respective roles in calculating the reliability of a network, are briefly reviewed. The computational advantages of the former, and the interpretive richness of the latter, beg the question: how a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics & Probability Letters
سال: 2013
ISSN: 0167-7152
DOI: 10.1016/j.spl.2012.11.018